precomplete set

Игры ⚽ Поможем решить контрольную работу

Kleene's recursion theorem — In computability theory, Kleene s recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions. The theorems were first proved by Stephen Kleene in 1938.This article uses the… … Wikipedia
Complete numbering — In computability theory complete numberings are generalizations of Gödel numbering first introduced by A.I. Mal tsev in 1963. They are studied because several important results like the Kleene s recursion theorem and Rice s theorem, which were… … Wikipedia

Словари и энциклопедии на Академике